On the complex exponentiation restricted to the integers
نویسندگان
چکیده
We provide a first order axiomatization of the expansion of the complex field by the exponential function restricted to the subring of integers modulo the first order theory of (Z, +, ·). 2000 Mathematics Subject Classification: 03C60
منابع مشابه
Some integer formula-encodings and related algorithms
We investigate the special class of formulas made up of arbitrary but finite combinations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such formulas, we describe two essentially distinct families of canonical formula-encodings for integers, respectively deduced from the decimal encoding and the fund...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملSecurity Systems Based on Gaussian Integers : Analysis of Basic Operations and Time Complexity of Secret Transformations
SECURITY SYSTEMS BASED ON GAUSSIAN INTEGERS: ANALYSIS OF BASIC OPERATIONS AND TIME COMPLEXITY OF SECRET TRANSFORMATIONS by Aleksey Koval Many security algorithms currently in use rely heavily on integer arithmetic modulo prime numbers. Gaussian integers can be used with most security algorithms that are formulated for real integers. The aim of this work is to study the benefits of common securi...
متن کاملModular exponentiation via the explicit Chinese remainder theorem
Fix pairwise coprime positive integers p1, p2, . . . , ps. We propose representing integers u modulo m, where m is any positive integer up to roughly √ p1p2 · · · ps, as vectors (u mod p1, u mod p2, . . . , u mod ps). We use this representation to obtain a new result on the parallel complexity of modular exponentiation: there is an algorithm for the Common CRCW PRAM that, given positive integer...
متن کاملVertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
متن کامل